CORRIGENDUM Order Independence for Iterated Weak Dominance
نویسندگان
چکیده
In Marx and Swinkels (1997), we identify a condition on a normal form game, transference of decisionmaker indifference (TDI), under which the order of elimination by weak dominance does not matter. That is, regardless of the order in which weakly dominated strategies are removed, any two full reductions—games in which no further removals are possible—are the same up to the addition or removal of redundant strategies and the renaming of equivalent strategies. TDI requires that if, for a given pure strategy profile s−i for the other players, player i is indifferent between two of his pure strategies si and ti, then the other players are indifferent between si; s−i and ti; s−i as well. We also define nice weak dominance (NWD) and explore its implications. A weak dominance is nice if TDI is satisfied for the pair of strategies involved.
منابع مشابه
Order Independence for Iterated Weak Dominance
In general, the result of the elimination of weakly dominated strategies depends on order. We define nice weak dominance. Under nice weak dominance, order does not matter. We identify an important class of games under which nice weak dominance and weak dominance are equivalent, and so the order under weak dominance does not matter. For all games, the result of iterative nice weak dominance is a...
متن کاملIterated weak dominance and subgame dominance
In this paper, we consider finite normal form games satisfying transference of decisionmaker indifference. We show that any set of strategies surviving k rounds of elimination of some weakly dominated strategies can be reduced to a set of strategies equivalent to the set of strategies surviving k rounds of elimination of all weakly dominated strategies in every round by (at most k) further roun...
متن کاملIterated Weaker-than-Weak Dominance
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution accuracy. Equilibria of a game obtained by eliminating a δ-dominated strategy are guaranteed to be approximate equilibria of the original game, with degree of approximation bounded by the dominance parameter, δ. We can ...
متن کاملAdaptive Learning and Iterated Weak Dominance
This article addresses the idea that rational players should not play iteratively weakly dominated strategies by showing that when a particular type of adaptive learning process converges, then players must have learned to play strategy profiles equivalent to those that survive iterated nice weak dominance and, for certain games, equivalent to those that survive iterated weak dominance. For gam...
متن کاملInstitute of Economics University of Copenhagen Iterated
In this paper, we consider finite normal form games satisfying transference of decisionmaker indifference. We show that any set of strategies surviving k rounds of elimination of some weakly dominated strategies can be reduced to a set of strategies equivalent to the set of strategies surviving k rounds of elimination of all weakly dominated strategies in every round by (at most k) further roun...
متن کامل